ONE MODULO THREE MEAN LABELING OF CYCLE RELATED GRAPHS
نویسندگان
چکیده
منابع مشابه
One Modulo Three Mean Labeling of Graphs
In this paper, we introduce a new labeling called one modulo three mean labeling. A graph G is said to be one modulo three mean graph if there is an injective function φ from the vertex set of G to the set {a | 0 ≤ a ≤ 3q2 and either a≡0(mod 3) or a≡1(mod 3) } where q is the number of edges of G and φ induces a bijection φ * from the edge set of G to { } |1 3 2 and ( 3) a a q a 1 mod ≤ ≤ − ≡ gi...
متن کاملOne Modulo Three Harmonic Mean Labeling of Graphs
In this paper, we introduce a new labeling called one modulo three harmonic mean labeling. A graph G is said to be one modulo three harmonic mean graph if there is a function φ from the vertex set of G to {1, 3, 4, ... ,3 − 2, 3 } with φ is one-one and φ induces a bijection φ∗ from the edge set of G to {1, 4, ..., 3q 2}, where φ∗(e = uv) = ( ) ( ) ( ) ( ) or ( ) ( ) ( ) ( ) and the function φ i...
متن کاملEdge pair sum labeling of some cycle related graphs
Let G be a (p,q) graph. An injective map f : E(G) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*: V (G) → Z - {0} defined by f*(v) = ΣP∈Ev f (e) is one-one where Ev denotes the set of edges in G that are incident with a vertex v and f*(V (G)) is either of the form {±k1,±k2,...,±kp/2} or {±k1,±k2,...,±k(p-1)/2} U {±k(p+1)/2} according as p is even or o...
متن کامل3-difference cordial labeling of some cycle related graphs
Let G be a (p, q) graph. Let k be an integer with 2 ≤ k ≤ p and f from V (G) to the set {1, 2, . . . , k} be a map. For each edge uv, assign the label |f(u) − f(v)|. The function f is called a k-difference cordial labeling of G if |νf (i) − vf (j)| ≤ 1 and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labelled with x (x ∈ {1, 2 . . . , k}), ef (1) and ef (0) respectively den...
متن کامل$4$-Total prime cordial labeling of some cycle related graphs
Let $G$ be a $(p,q)$ graph. Let $f:V(G)to{1,2, ldots, k}$ be a map where $k in mathbb{N}$ and $k>1$. For each edge $uv$, assign the label $gcd(f(u),f(v))$. $f$ is called $k$-Total prime cordial labeling of $G$ if $left|t_{f}(i)-t_{f}(j)right|leq 1$, $i,j in {1,2, cdots,k}$ where $t_{f}(x)$ denotes the total number of vertices and the edges labelled with $x$. A graph with a $k$-total prime cordi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Pure and Apllied Mathematics
سال: 2015
ISSN: 1311-8080,1314-3395
DOI: 10.12732/ijpam.v103i4.3